A Complete Axiomatization for Blocks World

نویسندگان

  • Stephen A. Cook
  • Yongmei Liu
چکیده

Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving justification for its soundness and completeness. In this paper, we model a state of BW by a finite collection of finite chains, and call the theory of all these structures BW theory. We present seven simple axioms and prove that their consequences are precisely BW theory, using Ehrenfeucht-Fräıssé games. We give a simple decision procedure for the theory which can be implemented in exponential space, and prove that every decision procedure (even if nondeterministic) for the theory must take at least exponential time. We also give a characterization of all nonstandard models for the theory. Finally, we present an expansion of BW theory and show that it admits elimination of quantifiers. As a result, we are able to characterize all definable predicates in BW theory, and give simple examples of undefinable predicates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple axiomatization of reticulations on residuated lattices

‎We give a simple and independent axiomatization of reticulations on residuated lattices‎, ‎which were axiomatized by five conditions in [C‎. ‎Mureşan‎, ‎The reticulation of a residuated lattice‎, ‎Bull‎. ‎Math‎. ‎Soc‎. ‎Sci‎. ‎Math‎. ‎Roumanie‎ ‎51 (2008)‎, ‎no‎. ‎1‎, ‎47--65]‎. ‎Moreover‎, ‎we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...

متن کامل

Complete Axiomatization of Observation Congruence for Pmc Complete Axiomatization of Observation Congruence for Pmc

In AM93b] an asynchronous process algebra with multiple clocks, called PMC, was introduced and a complete axiomatization of strong bisimulation equivalence was given for a class of nite state processes. In this report we show how to extend the equational calculus so as to arrive at a complete axiomatization of observation congruence. Completeness is proven for the class of nite processes. With ...

متن کامل

Characterization and axiomatization of all semigroups whose square is group

In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup).  Finally, several equivalent conditions ...

متن کامل

On the Axiomatizability of Impossible Futures

A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves ω-completeness. It is applicable to semantics at least as coarse as impossible futures semantics. As an application, groundand ω-complete axiomatizations are de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2002